As Soon as Possible: Time Optimal Control for Timed Automata
نویسندگان
چکیده
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from every state, the remaining behaviors reach F as soon as possible. This consists in extending the controller synthesis problem for timed automata, solved in [MPS95,AMPS98], to deal with quantitative properties of behaviors. The problem is formulated using the notion of a timed game automaton, and an optimal strategy is constructed as a fixed-point of an operator on the space of value functions defined on state-clock configurations.
منابع مشابه
One Clock Priced Timed Automata: Model Checking and Optimal Strategies
In this paper, we consider priced (or weighted) timed automata, and prove various decidability results when the automaton has only one clock: we prove that model checking of WCTL is decidable and that optimal costs in priced timed games are computable. In contrast, it has recently been proved that these problems are undecidable for this model as soon as the system has three clocks.
متن کاملPlaying Optimally on Timed Automata with Random Delays
We marry continuous time Markov decision processes (CTMDPs) with stochastic timed automata into a model with joint expressive power. This extension is very natural, as the two original models already share exponentially distributed sojourn times in locations. It enriches CTMDPs with timing constraints, or symmetrically, stochastic timed automata with one conscious player. Our model maintains th...
متن کاملControl Synthesis of Discrete Manufacturing Systems using Timed Finite Automata
An application of timed game automaton to the control synthesis of discrete manufacturing systems is presented in the paper. This approach adopts the algorithm for optimal control synthesis of timed automata proposed in [1] as a game-theoretic approach between controller and the model of the plant. KeyWords: Timed automata, control synthesis, model verification, production systems.
متن کاملA Kleene-Schützenberger Theorem for Weighted Timed Automata
During the last years, weighted timed automata (WTA) have received much interest in the real-time community. Weighted timed automata form an extension of timed automata and allow us to assign weights (costs) to both locations and edges. This model, introduced by Alur et al. (2001) and Behrmann et al. (2001), permits the treatment of continuous consumption of resources and has led to much resear...
متن کاملSupervisory Control of Real-time Discrete Event Systems under Partial Observation
In this paper, we address the issue of synthesizing an optimal supervisor for real-time discrete event systems modeled by timed automata and under partial observation. Our approach is based on a method of transformation of timed automata into particular finite state automata called Set-Exp-Automata. That is, given the timed automata of the plant and the specification, we construct two Set-Exp-A...
متن کامل